Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
نویسندگان
چکیده
منابع مشابه
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
I this paper, we consider a stochastic and time-dependent version of the min-cost integer multicommodityflow problem that arises in the dynamic resource allocation context. In this problem class, tasks arriving over time have to be covered by a set of indivisible and reusable resources of different types. The assignment of a resource to a task removes the task from the system, modifies the reso...
متن کاملStochastic Dual Dynamic Integer Programming
Multistage stochastic integer programming (MSIP) combines the difficulty of uncertainty, dynamics, and non-convexity, and constitutes a class of extremely challenging problems. A common formulation for these problems is a dynamic programming formulation involving nested cost-to-go functions. In the linear setting, the cost-to-go functions are convex polyhedral, and decomposition algorithms, suc...
متن کاملTwo Polynomial Time Solvable Multicommodity Flow Problems
The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations.
متن کاملApproximations in stochastic and robust programming problems
Optimization procedures are very useful tools in many economic decision-making problems. We deal with the case of optimization problems where uncertainties in parameters occur. The stochastic programming approach considers the probability distribution of uncertain parameters and seeks for a solution that is feasible up to a certain level of probability (chance-constrained programming). Robust p...
متن کاملAn Adaptive Dynamic Programming Algorithm for Integer Stochastic, Dynamic Resource Allocation Problems
We consider a stochastic version of a dynamic resource allocation problem. In this setting, reusable resources must be assigned to tasks that arise randomly over time. Both resources and tasks are heterogeneous, and servicing a task generally will change the attributes of a resource. These problems arise in eet management, personnel training and assignment, and the remnant inventory problem. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2006
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1040.0079